Minimum cost spanning tree problems as value sharing problems

Minimum cost spanning tree (mcst) problems study situations in which agents must connect to a source obtain good, with the of building an edge being independent number users. We reinterpret mcst as value sharing problems, and show that folk cycle-complete solutions, two most studied cost-sharing solutions for do not share values consistent way. More precisely, yielding same problem might lead shared different ways. However, they satisfy weaker version property applies only elementary on can be 0 or 1. The solution satisfies related public approach, while one private differ depending if we allow group use nodes other their own nodes. then build axiomatizations built these properties. While are usually seen competitors results point towards interpretation: based interpretations problem, but otherwise conceptually very close.